Lower Bounds on the Area Requirements of Series-Parallel Graphs
نویسنده
چکیده
We show that there exist series-parallel graphs requiring Ω(n2 √ ) area in any straight-line or poly-line grid drawing. Such a result is achieved in two steps. First, we show that, in any straight-line or poly-line drawing of K2,n, one side of the bounding box has length Ω(n), thus answering two questions posed by Biedl et al. Second, we show a family of series-parallel graphs requiring Ω(2 √ ) width and Ω(2 √ ) height in any straight-line or poly-line grid drawing. Combining the two results, the Ω(n2 √ ) area lower bound is achieved.
منابع مشابه
Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs
We show that there exist series-parallel graphs requiring Ω(n2 √ ) area in any straight-line or poly-line grid drawing. Such a result is achieved in two steps. First, we show that, in any straight-line or poly-line drawing of K2,n, one side of the bounding box has length Ω(n), thus answering two questions posed by Biedl et al. Second, we show a family of series-parallel graphs requiring Ω(2 √ )...
متن کاملOn the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملBounds on circular consecutive choosability
The circular consecutive choosability chcc(G) of a graph G has been recently introduced in [2]. In this paper we prove upper bounds on chcc for series-parallel graphs, planar graphs and k-choosable graphs. Our bounds are tight for classes of series-parallel graphs and k-choosable graphs for k ≥ 3. Then we study the circular consecutive choosability of generalized theta graphs. Lower bounds for ...
متن کاملStochastic Comparisons of Series and Parallel Systems with Heterogeneous Extended Generalized Exponential Components
In this paper, we discuss the usual stochastic‎, ‎likelihood ratio, ‎dispersive and convex transform order between two parallel systems with independent heterogeneous extended generalized exponential components. ‎We also establish the usual stochastic order between series systems from two independent heterogeneous extended generalized exponential samples. ‎Finally, ‎we f...
متن کاملUpper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کامل